Comparator Networks for Binary Heap Construction

The Bounds of Min-Max Pair Heap Construction

m this paper, lower and upper bounds for min-max pair heap construction has been presented. It has been shown that the construction of a min-max pair heap with n elements requires at least 2.07n element comparisons. A new algorithm for creating min-max pair heap has been devised that lowers the upper bound to 2.43n. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Algorithm, Heap, Min...

Comparator Networks for Binary

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

We show how to build a binary heap in-place in linear time by performing ∼1.625n element comparisons, at most ∼2.125n element moves, and ∼n/B cache misses, where n is the size of the input array, B the capacity of the cache line, and ∼f(n) approaches f(n) as n grows. The same bound for element comparisons was derived and conjectured to be optimal by Gonnet and Munro; however, their procedure re...

Fuzzy Neural Networks

This paper comparator networks a well-known model of parallel computation. This model is used extensively for keys arrangement tasks such as sorting and selection. This work investigates several aspects of comparator networks. It starts with presenting handy tools for analysis of comparator networks in the form of conclusive sets non-binary vectors that verify a specific functionality. The 0-1 ...

A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm

In this paper a tight bound on the worst-case number of comparisons for Floyd’s well known heap construction algorithm, is derived. It is shown that at most 2n− 2μ(n)− σ(n) comparisons are executed in the worst case, where μ(n) is the number of ones and σ(n) is the number of zeros after the last one in the binary representation of the number of keys n.